Compositional Semantics of Non-Deterministic Synchronous Languages
نویسندگان
چکیده
A key feature of synchronous languages is that they conciliate con-currency with determinism. This is achieved by detecting so-called causality errors BG92, HM95, STB95], which occur when the composition of deterministic processes is not deterministic. Although the existing synchronous languages only deal with deterministic programs, it is not a restriction of the approach. We show how a synchronous language can be extended with non deterministic processes, while still ensuring that process composition will never introduce non-determinism. We give an operational semantics of the language, and show that the equivalence relation induced by this semantics is a congruence for all the language constructs.
منابع مشابه
An Implementation of Constructive Synchronous Programs in POLIS
Design tools for embedded reactive systems commonly use a model of computation that employs both synchronous and asynchronous communication styles. We form a junction between these two with an implementation of synchronous languages and circuits (Esterel) on asynchronous networks (POLIS). We implement fact propagation, the key concept of synchronous constructive semantics, on an asynchronous no...
متن کاملLogical semantics of Esterel with unconstrained local signals
Esterel is a synchronous programming language where processes interact through signals. The logical semantics of this language express the meaning of each syntactic constructions, knowing a priori the set of emitted signals. Nevertheless, a special case have to be made for local signals, making the semantics non-deterministic. In this paper, we propose a new logical semantics where the rules ar...
متن کاملCompositionality Criteria for Defining Mixed-Styles Synchronous Languages
This is not a paper about compositionality in itself, nor a general paper about mixing synchronous languages. We rst recall that compositionality appears in three places in the deenition of synchronous languages : 1) the synchrony hypothesis guarantees that the formal semantics of the language is compositional (in the sense that there exists an appropriate congruence) ; 2) programming environme...
متن کاملA Compositional Coalgebraic Semantics of Strategic Games
We provide a compositional coalgebraic semantics for strategic games. In our framework, like in the semantics of functional programming languages, coalgebras represent the observable behaviour of systems derived from the behaviour of the parts over an unobservable state space. We use coalgebras to describe and program stage games, finitely and potentially infinitely repeated hierarchical or par...
متن کاملArgos: an automaton-based synchronous language
Argos belongs to the family of synchronous languages, designed for programming reactive systems: (Lustre (Proceedings of the 14th Symposium on Principles of Programming Languages, Munich, 1987; Proc. IEEE 79(9) (1999) 1305), Esterel (Sci. Comput. Programming 19(2) (1992) 87), Signal (Technical Report, IRISA Report 246, IRISA, Rennes, France, 1985). Argos is a set of operators that allow to comb...
متن کامل